Subdimensional expansion for multirobot path planning
نویسندگان
چکیده
منابع مشابه
Subdimensional expansion for multirobot path planning
Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded i...
متن کاملSubdimensional Expansion: A Framework for Computationally Tractable Multirobot Path Planning
Planning optimal paths for large numbers of robots is computationally expensive. In this thesis, we present a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded in...
متن کاملMultirobot Task Allocation with Real-Time Path Planning
We consider the multi-robot task allocation (MRTA) problem in an initially unknown environment. The objective of the MRTA problem is to find a schedule or sequence of tasks that should be performed by a set of robots so that the cost or energy expended by the robots is minimized. Existing solutions for the MRTA problem mainly concentrate on finding an efficient task allocation among robots, wit...
متن کاملSubdimensional Expansion and Optimal Task Reassignment
Multirobot path planning and task assignment are traditionally treated separately, however task assignment can greatly impact the difficulty of the path planning problem, and the ultimate quality of solution is dependent upon both. We introduce task reassignment, an approach to optimally solving the coupled task assignment and path planning problems. We show that task reassignment improves solu...
متن کاملMeet Point Planning for Multirobot Coordination
We present an approach for determining optimal meet points for a team of agents performing coordinated tasks in an environment. Such points represent the best locations at which the team should meet in order to complete their current task. We develop analytic solutions for finding these meet points and describe how these techniques can be applied to several different multi-agent coordination sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2015
ISSN: 0004-3702
DOI: 10.1016/j.artint.2014.11.001